-
Skew Strikes Back: New Developments in the Theory of Join Algorithms
Hung Q. Ngo, Christopher Ré, Atri Rudra
Graph algorithmics, Databases, graph databases
SIGMOD2014
-
Shared-Memory Parallel Maximal Clique Enumeration
Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura
Graph algorithmics
parallel
-
HyperANF: Approximating the Neighbourhood Function ofVery Large Graphs on a Budget
Paolo Boldi Marco RosaSebastiano Vigna
Graph algorithmics
HyperLogLog
-
Why Is Maximum Clique Often Easy in Practice?
Jose L. Walteros, Austin Buchanan
Graph algorithmics
LiMass
-
New faster Kernighan-Lin-type graph-partitioning algorithms
Shantanu Dutt
Graph mining, Graph algorithmics
ICCAD1993
-
Recent Advances in Graph Partitioning
Aydın Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz
Graph algorithmics
survey
-
A simple linear-time modular decomposition algorithm for graphs, using order extension
Michel Habib, Fabien de Montgolfier, and Christophe Paul
Graph algorithmics
Graph compression, modular decomposition
-
Modularité asymptotique de quelques classes de graphes
Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
Graph mining, Graph algorithmics
modularity, in French
-
Local Graph Partitioning using PageRank Vectors
Reid Andersen, Fan Chung, Kevin Lang
Graph mining, Graph algorithmics
FOCS06, conductance, page rank
-
KClist++: A Simple Algorithm for Finding k-Clique DensestSubgraphs in Large Graphs
Maximilien Danisch, T-H. Hubert Chan, Mauro Sozio, Bintao Sun
Graph mining, Graph algorithmics
VLDB2020
-
Speedup Graph Processing by Graph Ordering
Hao Wei, Jeffrey Xu Yu, Can Lu, Xuemin Lin
Graph algorithmics
SIGMOD2016
-
The Power of Pivoting for Exact Clique Counting
Shweta Jain, C. Seshadhri
Graph algorithmics
WSDM2020
-
Fast and High Quality Multilevel Scheme forPartitioning Irregular Graphs
George Karypis, Vipin Kumar
Graph algorithmics
SIAM
-
O(√logn)Approximation Algorithms for Min UnCut, Min2CNF Deletion, and Directed Cut Problems
Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev
Graph algorithmics
STOC05
-
Karp-Sipser based kernels for bipartite graph matching
Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar
Graph algorithmics
SIAM
-
Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering
B. Charpentier, T. Bonald
Graph algorithmics
IJCAJ2019
-
LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding
Maximilien Danisch, Jean-Loup Guillaume, Ayan K. Bhowmick, Koushik Meneni, Bivas Mitra
Graph algorithmics, graph embeddings
WSDM2020
-
A cost function for similarity-based hierarchical clustering
Sanjoy Dasgupta
Graph algorithmics
Hierarchical graph clustering
-
Scalable Algorithms for Large and Dynamic Networks: Reducing Big Data for Small Computations
Iraj Saniee
Graph algorithmics
Real-world graph algorithmics
-
Are stable instances easy?
Yonatan Bilu, Nathan Linial
Graph algorithmics
Max-cut, LiMass
-
Listing k-cliques in Sparse Real-World Graphs
Maximilien Danisch, Mauro Sozio, Oana Balalau
Graph algorithmics
Real-world graph algorithmics
-
An Information-theoretic Framework for the Lossy Compression of Link Streams
Robin Lamarche-Perrin
network science, Graph, Dynamic graph, Graph algorithmics, graph theory, Data Structures and Algorithms (cs.DS), Artificial Intelligence (cs.AI), Information Theory (cs.IT), Graph compression
Graph compression, Link streams, Structural equivalence, Information theory, Combinatorial optimisation, Complex Networks
-
A Correlation Clustering Framework for Community Detection
Nate Veldt
Graph algorithmics
WWW2018
-
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples
Ali Pinar, Shweta Jain, Talya Eden, Dana Ron, C. Seshadhr
Graph algorithmics
WWW2018
-
Fast Approximation of Centrality
David Eppstein, Joseph Wang
Graph algorithmics
Centrality
-
In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond
Paolo Boldi, Sebastiano Vigna
Graph algorithmics
graph, Centrality
-
Practical Algorithms for Linear Boolean-width
Chiel B. ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender
Graph algorithmics
Linear Boolean-width
-
Fast Approximation of Centrality
David Eppstein, Joseph Wang
Graph algorithmics
Centrality
-
A Faster Algorithm for Betweenness Centrality
Ulrik Brandes
Graph algorithmics
Centrality